A Strati cation Test for Temporal Logic Programs

نویسندگان

  • Christos Nomikos
  • Panos Rondogiannis
  • Manolis Gergatsoulis
چکیده

In this paper we propose a new strati cation test for linear time temporal logic programs More speci cally we extend the cycle sum test Ron to take into account negatively signed edges in the cycle sum graph In this way we broaden the class of temporal logic programs which are acceptable by the test Moreover we demonstrate that the cycle sum test can be used to decide local stati cation for a broad class of temporal logic programs

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrating Dynamic Aspects into Deductive Object-Oriented Databases

We show how the dynamics of database systems can be mod eled by making states rst class citizens in an object oriented deductive database language With states at the same time acting as objects meth ods or classes several concepts of dynamic entities can be implemented allowing an intuitive declarative modeling of the application domain Exploiting the natural strati cation induced by the state ...

متن کامل

Constraint Strati cation in Deductive Databases

We propose a syntactic condition on deductive database programs that ensures a two-valued well-founded model. This condition, called constraint stratiication, is signiicantly more general than previous syntactic conditions such as stratiication and local stratiication. Modular stratiication has been proposed as a semantic (i.e., nonsyntactic) condition for ensuring a two-valued well-founded mod...

متن کامل

A Syntactic Strati cation Condition Using Constraints

Stratiication conditions for logic programs aim to ensure a two-valued semantics by restricting the class of allowable programs. Previous stratiication conditions suuer from one of two problems. Some (such as modular stratiication and weak stratiication) are semantic, and cannot be recognized without examining the facts in addition to the rules of the program. Others (such as stratiication and ...

متن کامل

Universit a Degli Studi Isalog (:) : a Deductive Language with Negation for Complex-object Databases with Hierarchies

IsaLog(:) is a research activity aimed at developing a framework that integrates deductive and object-oriented features. The data model has complex objects with classes, relations, and isa hierarchies, and the language is rule based. The main issue is the de nition of the semantics of the language. For the (positive) IsaLog framework three di erent semantics are given and proven to be equivalen...

متن کامل

Evaluation Aspects of an Object-oriented Deductive Database Language

Recently, F-logic [KL89, KLW92] has been proposed as an attempt to extend deductive databases by typical concepts of object-oriented languages. Among these concepts are complex objects, (term-based) object identity, methods, classes, typing, inheritance and browsing. In [KLW92] syntax and model-theoretic semantics is discussed; however many algorithmic aspects which arise when computing the cor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002